Publicly Verifiable Outsourcing Computation for QR Decomposition Based on Blockchain
نویسندگان
چکیده
In the Big Data Era, outsourcing computation has become increasingly significant as it supplies resources for clients with limited resources. However, there are still many security challenges such payment fairness, privacy protection, and verification. this paper, we propose a secure publicly verifiable scheme large-scale matrix QR decomposition. proposed scheme, client can pay services through blockchain-based system which achieves fairness. Moreover, to protect privacy, both permutation block diagonal applied in encryption process. Meanwhile, achieve public verification, computational complexity is reduced by using digest technology. It worth mentioning that our provable under co-CDH assumption.
منابع مشابه
Hybrid Publicly Verifiable Computation
Publicly Verifiable Outsourced Computation (PVC) allows weak devices to delegate computations to more powerful servers, and to verify the correctness of results. Delegation and verification rely only on public parameters, and thus PVC lends itself to large multi-user systems where entities need not be registered. In such settings, individual user requirements may be diverse and cannot be realis...
متن کاملPublicly Verifiable Blind Quantum Computation
Blind quantum computation protocols allow a user with limited quantum technology to delegate an intractable computation to a quantum server while keeping the computation perfectly secret. Whereas in some protocols a user can verify that calculated outcomes are correct, a third party cannot do this, which allows a dishonest user or owner to benefit illegally. I propose a new blind quantum comput...
متن کاملRevocation in Publicly Verifiable Outsourced Computation
The combination of software-as-a-service and the increasing use of mobile devices gives rise to a considerable difference in computational power between servers and clients. Thus, there is a desire for clients to outsource the evaluation of complex functions to an external server. Servers providing such a service may be rewarded per computation, and as such have an incentive to cheat by returni...
متن کاملPublicly Verifiable Non-Interactive Arguments for Delegating Computation
We construct publicly verifiable non-interactive arguments that can be used to delegate polynomial time computations. These computationally sound proof systems are completely non-interactive in the common reference string model. The verifier’s running time is nearly-linear in the input length, and poly-logarithmic in the complexity of the delegated computation. Our protocol is based on graded e...
متن کاملPublicly Verifiable Outsourced Computation with a Key Distribution Centre
The combination of software-as-a-service and the increasing use of mobile devices gives rise to a considerable difference in computational power between servers and clients. Thus, there is a desire for clients to outsource the evaluation of complex functions to a server and to be able to verify that the resulting value is correct. Previous work in this area of Publicly Verifiable Outsourced Com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Security and Communication Networks
سال: 2021
ISSN: ['1939-0122', '1939-0114']
DOI: https://doi.org/10.1155/2021/6632518